Exercise 1: Maximum Distance in Random Search Trees
نویسندگان
چکیده
We would like to stress that the ETH Disciplinary Code applies to this special assignment as it constitutes part of your final grade. The only exception we make to the Code is that we encourage you to verbally discuss the tasks with your colleagues. It is strictly prohibited to share any (hand)written or electronic (partial) solutions with any of your colleagues. We are obligated to inform the Rector of any violations of the Code.
منابع مشابه
Maximum Distance in Random Search
(a) For the cases n = 1, 2, 3 we observe that ∆n = 0, 1, 2, respectively, irrespective of the structure of the random search tree. We conclude that δ1 = 0, δ2 = 1, δ3 = 2. For the case n = 4 we observe that either ∆4 = 2 or ∆4 = 3, depending on the structure of the random search tree (∆4 > 2 because we already have ∆3 > 2 and the longest distance cannot decrease by adding more nodes, ∆4 6 3 bec...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملAn algorithm for `1 nearest neighbor search via monotonic embedding
Fast algorithms for nearest neighbor (NN) search have in large part focused on `2 distance. Here we develop an approach for `1 distance that begins with an explicit and exactly distance-preserving embedding of the points into `2. We show how this can efficiently be combined with random-projection based methods for `2 NN search, such as locality-sensitive hashing (LSH) or random projection trees...
متن کاملSpanning Tree Size in Random Binary Search Trees
This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal distribution. The special case p = 2 reproves the recent result (obtained by the contraction method by Mahmoud and Neininger [Ann. Appl. Probab. 13 (2003) 253–276...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014